Constraint-free Graphical Model with Fast Learning Algorithm

نویسندگان

  • Kazuya Takabatake
  • Shotaro Akaho
چکیده

In this paper, we propose a simple, versatile model for learning the structure and parameters of multivariate distributions from a data set. Learning a Markov network from a given data set is not a simple problem, because Markov networks rigorously represent Markov properties, and this rigor imposes complex constraints on the design of the networks. Our proposed model removes these constraints, acquiring important aspects from the information geometry. The proposed parameterand structure-learning algorithms are simple to execute as they are based solely on local computation at each node. Experiments demonstrate that our algorithms work appropriately.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Learning of Graphical Models

This habilitation thesis lies at the intersection of two research fields: online learning and graphical reasoning. On the one hand, online learning algorithms have been studied extensively in the machine learning literature, in which a collection of strong convergence properties have been proven. Most of these algorithms are endowed with remarkable performance for learning simple hypotheses: th...

متن کامل

No-Free-Lunch and Bayesian Optimality

We take a Bayesian approach to the issues of bias, meta bias, transfer, overfit, and No-Free-Lunch in the context of supervised learning. If we accept certain relationships between the function class, on training set data, and off training set data, then a graphical model can be created that represents the supervised learning problem. This graphical model dictates a specific algorithm which wil...

متن کامل

Inference and Learning with Graphical Models

Intelligent systems which work in the real world cooperating with humans should be able to treat complex, uncertain, dynamic, multi-modal information in the real world environment. Probability distributions with graphical structure (Graphical Models) are recently considered as a promising fundamental tools to represent and process such information. From this point of view, toward a theoretical ...

متن کامل

Approximate Contrastive Free Energies for Learning in Undirected Graphical Models

We present a novel class of learning algorithms for undirected graphical models, based on the contrastive free energy (CF). In particular we study the naive mean field, TAP and Bethe approximations to the contrastive free energy. The main advantage of CFlearning is the fact that it eliminates the need to infer equilibrium statistics for which mean field type approximations are particularly unsu...

متن کامل

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1206.3721  شماره 

صفحات  -

تاریخ انتشار 2012